Well-founded induction and the invariance theorem for loops
نویسنده
چکیده
For C a set well-founded with respect to the partial ordering DQG IRU Q.x a predicate possibly with free variable x, the theorem of well-founded induction states that (∀x: x∈C: Q.x) is equivalent to (∀x: x∈C: (∀y: y∈C ∧ y<x: Q.y) ⇒ Q.x). Well-founded induction is very general. For example the so-called "principle of strong induction" is well-founded induction on the set of natural numbers with their usual RUGHULQJ ZKLOH VR FDOOHG WUDQVILQLWH LQGXFWLRQ LV ZHOO IRXQGHG induction when the ordering LV WRWDO
منابع مشابه
One Loop at a Time
Classic techniques for proving termination require the identification of a measure mapping program states to the elements of a well founded domain and to show that this measure decreases with each iteration of a loop in the program. This is a global termination condition — there is a single measure which must be shown to decrease over all of the loops in the program. In this abstract we look at...
متن کاملThe concept of logic entropy on D-posets
In this paper, a new invariant called {it logic entropy} for dynamical systems on a D-poset is introduced. Also, the {it conditional logical entropy} is defined and then some of its properties are studied. The invariance of the {it logic entropy} of a system under isomorphism is proved. At the end, the notion of an $ m $-generator of a dynamical system is introduced and a version of the Kolm...
متن کاملComputing Loops with at Most One External Support Rule for Basic Logic Programs with Arbitrary Constraint Atoms
The well-founded semantics of logic programs is not only an important semantics but also serves as an essential tool for program simplification in answer set computations. Recently, it has been shown that for normal and disjunctive programs, the well-founded models can be computed by unit propagation on program completion and loop formulas of loops with no external support. An attractive featur...
متن کاملLeaping Loops in the Presence of Abstraction
Finite abstraction helps program analysis cope with the huge state space of programs. We wish to use abstraction in the process of error detection. Such a detection involves reachability analysis of the program. Reachability in an abstraction that under-approximates the program implies reachability in the concrete system. Under-approximation techniques, however, lose precision in the presence o...
متن کاملInvariance of the barycentric subdivision of a simplicial complex
In this paper we prove that a simplicial complex is determined uniquely up to isomorphism by its barycentric subdivision as well as its comparability graph. We also put together several algebraic, combinatorial and topological invariants of simplicial complexes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 32 شماره
صفحات -
تاریخ انتشار 1989